P-bipartitions of minor hereditary properties
نویسندگان
چکیده
We prove that for any two minor hereditary properties P1 and P2, such that P2 covers P1, and for any graph G ∈ P2 there is a P1bipartition of G. Some remarks on minimal reducible bounds are also included.
منابع مشابه
Ideal Amenability of Banach Algebras and Some Hereditary Properties
Let A be a Banach algebra. A is called ideally amenable if for every closed ideal I of A, the first cohomology group of A with coefficients in I* is trivial. We investigate the closed ideals I for which H1 (A,I* )={0}, whenever A is weakly amenable or a biflat Banach algebra. Also we give some hereditary properties of ideal amenability.
متن کاملPrevalence of renal tubular dysfunction in beta thalassemia minor in shiraz
Background & objective: β-Thalassemia minor is an asymptomatic hereditary disease. The first study on the relation of renal tubular dysfunction and β-thalassemia minor was performed in 2002 but those studies seem inadequate.The main goal of this study is through evaluation of renal tubular function in 100 patients with thalassemia minor. Materials & Methods: 100 patients with β- thalassemia...
متن کاملHereditary properties of amenability modulo an ideal of Banach algebras
In this paper we investigate some hereditary properties of amenability modulo an ideal of Banach algebras. We show that if $(e_alpha)_alpha$ is a bounded approximate identity modulo I of a Banach algebra A and X is a neo-unital modulo I, then $(e_alpha)_alpha$ is a bounded approximate identity for X. Moreover we show that amenability modulo an ideal of a Banach algebra A can be only considered ...
متن کاملFachbereich 3 Mathematik Testing Hereditary Properties Efficiently on Average Testing Hereditary Properties Eeciently on Average ?
We use the quasi-ordering of substructure relations such as induced and weak subgraph, induced suborder, graph minor or subformula of a CNF formula to obtain recognition algorithms for hereditary properties that are fast on average. The ingredients needed besides inheritance are independence of the occurrence of small substructures in a random input and the existence of algorithms for recogniti...
متن کاملRepresenting Partitions on Trees
In evolutionary biology, biologists often face the problem of constructing a phylogenetic tree on a set X of species from a multiset Π of partitions corresponding to various attributes of these species. One approach that is used to solve this problem is to try instead to associate a tree (or even a network) to the multiset ΣΠ consisting of all those bipartitions {A,X − A} with A a part of some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 17 شماره
صفحات -
تاریخ انتشار 1997